Adaptive Population NSGA-III with Dual Control Strategy for Flexible Job Shop Scheduling Problem with the Consideration of Energy Consumption and Weight
نویسندگان
چکیده
The flexible job shop scheduling problem has always been the focus of research in manufacturing field. However, most previous studies focused more on efficiency and ignored energy consumption. Energy, especially non-renewable energy, is an essential factor affecting sustainable development a country. To this end, paper designs model with consideration line production Except for processing stage, consumption transport, set up, unload, idle stage are also included our model. weight property jobs considered heavier job, it consumes during unload stage. Meanwhile, invents adaptive population non-dominated sorting genetic algorithm III (APNSGA-III) that combines dual control strategy (NSGA-III) to solve Four instances formulated examine performance algorithm. results achieved by APNSGA-III method compared five classic multi-objective optimization algorithms. show proposed efficient powerful when dealing includes
منابع مشابه
Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملA bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption
متن کامل
Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times
This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machines
سال: 2021
ISSN: ['2075-1702']
DOI: https://doi.org/10.3390/machines9120344